Asymptotics of overflow probabilities in Jackson networks
نویسنده
چکیده
We consider the probability that the total population of a Jackson network exceeds a given large value. By using the relation to the stationary distribution, we derive upper and lower bounds on this probability. These bounds imply a stronger logarithmic limit when multiple nodes have the same maximal load.
منابع مشابه
Optimal Sampling of Overflow Paths in Jackson Networks
We consider the problems of computing overflow probabilities at level N in any subset of stations in a Jackson network and of simulating sample paths conditional on overflow. We construct algorithms that take O (N) function evaluations to estimate such overflow probabilities within a prescribed relative accuracy and to simulate paths conditional on overflow at level N . The algorithms that we p...
متن کاملAdaptive Importance Sampling Simulation of Queueing Networks
In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabilities in Jackson queueing networks using importance sampling. The method differs in two ways from methods discussed in most earlier literature: the change of measure is state-dependent, i.e., it is a function of the content of the buffers, and the change of measure is determined using a cross-entr...
متن کاملAnalysis of a Splitting Estimator for Rare Event Probabilities in Jackson Networks
We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed initial position. It was shown in [8] that a subsolution to the Isaacs equation guarantees that a subexponential number of function evaluations (in n) suffice to estimate such overflow probabilities within a given relat...
متن کاملImportance sampling for Jackson networks with customer impatience until the end of service
Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. The standard approach, which simulates the system using an a priori fixed change of measure, has been shown to fail in even the simplest network settings. Estimating probabilities associated with rare events has been a topic of great importance in queuing theory, and in applied probabilit...
متن کاملImportance sampling for Jackson networks
Rare event simulation in the context of queueing networks has been an active area of research for more than two decades. A commonly used technique to increase the efficiency of Monte Carlo simulation is importance sampling. However, there are few rigorous results on the design of efficient or asymptotically optimal importance sampling schemes for queueing networks. Using a recently developed ga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 32 شماره
صفحات -
تاریخ انتشار 2004